نتایج جستجو برای: NP-hard problems

تعداد نتایج: 731128  

Journal: :journal of advances in computer research 2013
narges mahmoodi darani vahid ahmadi zahra saadati eskandari majid yousefikhoshbakht

the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

Journal: :journal of optimization in industrial engineering 2014
hossein larki majid yousefikhoshbakht

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

Journal: :Journal of the ACM 2013

Journal: :IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 1988

Journal: :journal of advances in computer research 2012
majid yousefikhoshbakht farzad didehvar farhad rahmati

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

Journal: :journal of advances in computer research 0

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Journal: :Information and Computation 2011

2012
Grace Murray Hopper Shimon Peres

A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید